Distributed Asynchronous Relaxation Methods for Linear Network Flow Problems
نویسندگان
چکیده
منابع مشابه
Distributed Asynchronous Relaxation Methods for Convex Network Flow Problems
We consider the solution of the single commodity strictly convex network flow problem in a distributed asynchronous computation environment. The dual of this problem is unconstrained, differentiable, and well suited for solution via Gauss-Seidel relaxation. We show that the structure of the dual allows the successful application of a distributed asynchronous method whereby relaxation iterations...
متن کاملDual coordinate step methods for linear network flow problems
We review a class of recently-proposed linear-cost network flow methods which are amenable to distributed implementation. All the methods in the class use the notion of e-complementary slackness, and most do not explicitly manipulate any "global" objects such as paths, trees, or cuts. Interestingly, these methods have stimulated a large number of new serial computational complexity results. We ...
متن کاملRelaxation Methods for Minimum Cost Network Flow
We view the optimal single commodity network flow problem with linear arc costs and its dual as a pair of monotropic programming problems, i.e. problems of minimizing the separable sum of scalar extended real-valued convex functions over a subspace. For such problems directions of cost improvement can be selected from among a finite set of directions--the elementary vectors of the constraint su...
متن کاملDeteriorating Convergence for Asynchronous Methods on Linear Least Sqare Problems
A block iterative method is used for solving linear least squares problems. The subproblems are solved asynchronously on a distributed memory multiprocessor. It is observed that an increased number of processors results in deteriorating rate of convergence. This deteriorating convergence is illustrated by numerical experiments. The deterioration of the convergence can be explained by contaminat...
متن کاملRelaxation Methods for Minimum Cost Ordinary and Generalized Network Flow Problems
We propose a new class of algorithms for linear cost network flow problems with and without gains. These algorithms are based on iterative improvement of a dual cost and operate in a manner that is reminiscent of coordinate ascent and Gauss-Seidel relaxation methods. We compare our coded implementations of these methods with mature state-of-theart primal simplex and primal-dual codes, and find ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IFAC Proceedings Volumes
سال: 1987
ISSN: 1474-6670
DOI: 10.1016/s1474-6670(17)55135-6